The Missing Data Encoder: Cross-Channel Image Completion with Hide-and-Seek Adversarial Network
نویسندگان
چکیده
منابع مشابه
Hide and Seek with Supersymmetry
This is the summary of a 90 minute introductory talk on Supersymmetry presented at the August 1998 Zuoz Summer School on “Hidden Symmetries and Higgs Phenomena”. I first review the hierarchy problem, and then discuss why we expect supersymmetry just around the corner, i.e. at or below 1TeV . I focus on the specific example of the anomalous magnetic moment of the muon to show how supersymmetry c...
متن کاملLow-Rank Matrix Completion with Adversarial Missing Entries
We give an algorithm for completing an order-m symmetric low-rank tensor from its multilinear entries in time roughly proportional to the number of tensor entries. We apply our tensor completion algorithm to the problem of learning mixtures of product distributions over the hypercube, obtaining new algorithmic results. If the centers of the product distribution are linearly independent, then we...
متن کاملPlaying "Hide and Seek" with Stored Keys
In this paper we consider the problem of efficiently locating cryptographic keys hidden in gigabytes of data, such as the complete file system of a typical PC. We describe efficient algebraic attacks which can locate secret RSA keys in long bit strings, and more general statistical attacks which can find arbitrary cryptographic keys embedded in large programs. These techniques can be used to ap...
متن کاملPlaying Hide-and-Seek with Yeast
I like to think of the late 80s and early 90s as extremely exciting times in my career. I was working as a visiting graduate student in Rick Gaber’s laboratory at Northwestern University, and some of the work I did during those years turned out to be seminal for the then-fledgling field of epigenetics. Together with other scientists, I provided long-awaited in vivo functional evidence for a mod...
متن کاملHide-and-Seek with Directional Sensing
We consider a game played between a hider, who hides a static object in one of several possible positions in a bounded planar region, and a searcher, who wishes to reach the object by querying sensors placed in the plane. The searcher is a mobile agent, and whenever it physically visits a sensor, the sensor returns a random direction, corresponding to a half-plane in which the hidden object is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the AAAI Conference on Artificial Intelligence
سال: 2020
ISSN: 2374-3468,2159-5399
DOI: 10.1609/aaai.v34i07.6696